Program development in constructive type theory
نویسندگان
چکیده
منابع مشابه
Program Development in Constructive
We present the program development concept in a logical framework including constructive type theory and then show how to use such theories to derive programs from proofs of formal speciications. We are interested in two important facts that are the mechanization of the proof construction and the possibility to express in the theory signiiciant concepts for programming (like inductively deened ...
متن کاملConstructive Algebra in Type Theory
This thesis contains four papers aiming at bridging the gap between algorithms implemented in computer algebra systems and interactive proof assistants. This is done by implementing and verifying efficient algorithms using the Coq proof assistant together with the SSReflect extension. First there is a methodology, based on refinements, for linking implementations of algorithms using rich depend...
متن کاملLecture 24 – Constructive Type Theory
By the 21st century, constructive type theory emerged as a unifying framework for logic, mathematics, and computer science. One of the prime movers was L.E.J. Brouwer who understood mathematics in terms of mental constructions and offered a novel account of both the logical operators and the basic mathematical entities such as natural numbers, real numbers, points, and spaces. His deep and orig...
متن کاملTECH REPORT: Trees in Constructive Type Theory
Trees are pervasive in the literature of data structures and algorithms. Every computer science undergraduate has an understanding of at least how trees function as part of their chosen field as well as their formation. The foundations of many abstract data types rely on trees and the ability to quickly and efficiently search and organize large data sets often seems to be wholly dependent on tr...
متن کاملHereditarily Finite Sets in Constructive Type Theory
We axiomatize hereditarily finite sets in constructive type theory and show that all models of the axiomatization are isomorphic. The axiomatization takes the empty set and adjunction as primitives and comes with a strong induction principle. Based on the axiomatization, we construct the set operations of ZF and develop the basic theory of finite ordinals and cardinality. We construct a model o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1992
ISSN: 0304-3975
DOI: 10.1016/0304-3975(92)90037-g